skip to main content
research-article

A finite equational base for CCS with left merge and communication merge

Authors Info & Claims
Published:23 January 2009Publication History
Skip Abstract Section

Abstract

Using the left merge and the communication merge from ACP, we present an equational base (i.e., a ground-complete and ω-complete set of valid equations) for the fragment of CCS without recursion, restriction and relabeling modulo (strong) bisimilarity. Our equational base is finite if the set of actions is finite.

References

  1. Aceto, L., Fokkink, W. J., Ingolfsdottir, A., and Luttik, B. 2005a. CCS with Hennessy's merge has no finite equational axiomatization. Theoret. Comput. Sci. 330, 3, 377--405. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. Aceto, L., Fokkink, W. J., Ingolfsdottir, A., and Luttik, B. 2005b. Finite equational bases in process algebra: Results and open questions. In Processes, Terms and Cycles: Steps on the Road to Infinity, A. Middeldorp, V. van Oostrom, F. van Raamsdonk, and R. C. de Vrijer, Eds. Lecture Notes in Computer Science, vol. 3838. Springer-Verlag, Berlin, Germany, 338--367. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. Baeten, J. C. M. and Bravetti, M. 2005. A ground-complete axiomatization of finite state processes in process algebra. In Proceedings of the 16th International Conference on Concurrency Theory (CONCUR'05), M. Abadi and L. de Alfaro, Eds. Lecture Notes in Computer Science, vol. 3653. Springer-Verlag, Berlin, Germany, 248--262. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Bergstra, J. A. and Klop, J. W. 1984. Process algebra for synchronous communication. Inform. Control 60, 1-3, 109--137.Google ScholarGoogle ScholarCross RefCross Ref
  5. Bergstra, J. A. and Tucker, J. V. 1985. Top-down design and the algebra of communicating processes. Sci. Comput. Program. 5, 2, 171--199. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. Christensen, S., Hirshfeld, Y., and Moller, F. 1994. Decidable subsets of CCS. Comput. J. 37, 4, 233--242.Google ScholarGoogle ScholarCross RefCross Ref
  7. de Simone, R. 1985. Higher-level synchronising devices in Meije-SCCS. Theoret. Comput. Sci. 37, 245--267.Google ScholarGoogle ScholarCross RefCross Ref
  8. Groote, J. F. 1990. A new strategy for proving ω-completeness applied to process algebra. In Proceedings of the 2nd International Conference on Concurrency Theory (CONCUR'90), J. C. M. Baeten and J. W. Klop, Eds. Lecture Notes in Computer Science, vol. 458. Springer-Verlag, Berlin, Germany, 314--331. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. Heering, J. 1986. Partial evaluation and ω-completeness of algebraic specifications. Theoret. Comput. Sci. 43, 2-3, 149--167. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. Hennessy, M. 1988. Axiomatising finite concurrent processes. SIAM J. Comput. 17, 5, 997--1017. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. Hennessy, M. and Milner, R. 1985. Algebraic laws for nondeterminism and concurrency. J. ACM 32, 1 (Jan.), 137--161. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. Luttik, B. and van Oostrom, V. 2005. Decomposition orders—another proof of the fundamental theorem of arithmetic. Theoret. Comput. Sci. 335, 2--3, 147--186. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. Milner, R. 1980. A Calculus of Communicating Systems. Lecture Notes in Computer Science, vol. 92. Springer--Verlag, Berlin, Germany, Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. Milner, R. 1984. A complete inference system for a class of regular behaviours. J. Comput. Syst. Sci. 28, 3, 439--466.Google ScholarGoogle ScholarCross RefCross Ref
  15. Milner, R. 1989a. Communication and Concurrency. Prentice-Hall, Englewood Cliffs, NJ. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. Milner, R. 1989b. A complete axiomatisation for observational congruence of finite-state behaviors. Inf. Comput. 81, 2, 227--247. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. Milner, R. and Moller, F. 1993. Unique decomposition of processes. Theoret. Comput. Sci. 107, 357--363. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. Moller, F. 1989. Axioms for concurrency. Ph.D. dissertatish. University of Edinburgh, Edinburgh, UK.Google ScholarGoogle Scholar
  19. Moller, F. 1990. The nonexistence of finite axiomatisations for CCS congruences. In Proceedings of the IEEE Symposium on Logic in Computer Science (LICS'90). IEEE Computer Society Press, Los Alamitos, CA, 142--153.Google ScholarGoogle ScholarCross RefCross Ref
  20. Park, D. M. R. 1981. Concurrency and automata on infinite sequences. In Proceedings of the 5th GI Conference, P. Deussen, Ed. Lecture Notes in Computer Science, vol. 104. Springer-Verlag, Berlin Germany, 167--183. Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. Sewell, P. 1994. Bisimulation is not finitely (first order) equationally axiomatisable. In Proceedings of the IEEE Symposium on Logic in Computer Science (LICS'94). IEEE Computer Society Press, Los Alamitos, CA, 62--70.Google ScholarGoogle ScholarCross RefCross Ref
  22. van Tilburg, P. J. A. 2007. Finite equational bases for CCS with restriction. M.S. thesis, Technische Universiteit Eindhoven.Google ScholarGoogle Scholar

Index Terms

  1. A finite equational base for CCS with left merge and communication merge

            Recommendations

            Comments

            Login options

            Check if you have access through your login credentials or your institution to get full access on this article.

            Sign in

            Full Access

            • Published in

              cover image ACM Transactions on Computational Logic
              ACM Transactions on Computational Logic  Volume 10, Issue 1
              January 2009
              271 pages
              ISSN:1529-3785
              EISSN:1557-945X
              DOI:10.1145/1459010
              Issue’s Table of Contents

              Copyright © 2009 ACM

              Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

              Publisher

              Association for Computing Machinery

              New York, NY, United States

              Publication History

              • Published: 23 January 2009
              • Revised: 1 July 2007
              • Accepted: 1 July 2007
              • Received: 1 August 2006
              Published in tocl Volume 10, Issue 1

              Permissions

              Request permissions about this article.

              Request Permissions

              Check for updates

              Qualifiers

              • research-article
              • Research
              • Refereed

            PDF Format

            View or Download as a PDF file.

            PDF

            eReader

            View online with eReader.

            eReader